On the superimposition of Christoffel words

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a generalization of Christoffel words: epichristoffel words

Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been extensively studied since the 18th century. One of the generalization of these sequences are the episturmian sequences, introduced by A. de Luca [dL97a] and studi...

متن کامل

Christoffel Words and the Calkin-Wilf Tree

In this note we present some results on the Calkin-Wilf tree of irreducible fractions, giving an insight on the duality relating it to the Stern-Brocot tree, and proving noncommutative versions of known results relating labels of the CalkinWilf trees to hyperbinary expansions of positive integers. The main tool is the Christoffel tree introduced in a paper by Berstel and de Luca.

متن کامل

the effect of translation versus matching words and definitions on retrieval of vocabulary among iranian intermediate efl learners

این تحقیق جهت بررسی تأثیر ترجمه در برابر ایجاد ارتباط بین لغات و ارائه معانی بر بازیابی واژگان در میان زبان آموزان متوسط ایرانی انجام شده است. به این منظور سه گروه کامل از دانش آموزان سطح متوسط که کتاب اینترچنج3 را مطالعه می کردند پس از انجام تست استاندارد مهارت سنجی انتخاب شدند. در ابتدا محقق آنها را به دو گروه آزمایشی و یک گروه کنترل یا شاهد تقسیم نمود و درمرحله بعد از کلیه دانش آموزان در سه ...

A d-dimensional extension of Christoffel words

In this article, we extend the definition of Christoffel words to directed subgraphs of the hypercubic lattice in arbitrary dimension that we call Christoffel graphs. Christoffel graphs when d = 2 correspond to well-known Christoffel words. Due to periodicity, the d-dimensional Christoffel graph can be embedded in a (d−1)-torus (a parallelogram when d = 3). We show that Christoffel graphs have ...

متن کامل

On an involution of Christoffel words and Sturmian morphisms

There is a natural involution on Christoffel words, originally studied by the second author in [dL2]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2011

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2010.10.007